Approximate Bisimulation Equivalence and Variable Refinement

نویسندگان

  • Bai Liu
  • Jinzhao Wu
  • Zhucheng Xie
چکیده

In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow event structures. These equivalence, bisimulation equivalence and approximate bisimulation equivalence are based on the common forms of their zeros. The example show that the equivalence, bisimulation equivalence and approximate bisimulation equivalence are preserved or not under the variables refinement, if the equivalence is not preserved precisely, then we can use the approximate methods to make them approximate equivalence. Lastly we show that our refinement has some nice properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branching time and orthogonal bisimulation equivalence

We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (i.e., the performance of τ -steps) may be compressed, but not completely discarded. Hence, a process with τ -steps cannot be equivalent to one without τ -steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equival...

متن کامل

Equivalence notions and refinement for timed Petri nets ?

The paper is contributed to develop a family of equivalence notions for real-time systems represented by labelled Merlin’s time Petri nets with zero length time intervals (i.e., with fixed time delays). We call them “timed Petri nets”. In particular, we introduce timed (time-sensitive), untimed (time-abstracting) and region (based on the notion of region [1]) equivalences in both the trace and ...

متن کامل

Solving Factored MDPs via Non-Homogeneous Partitioning

This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partitions. Homogeneity is defined in terms of bisimulation and reward equivalence within blocks of a partition. Since homogeneous partitions that define equivalent reduced state-space MDPs can have a large number of blocks, we...

متن کامل

Bisimulation for Demonic Schedulers

Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates with the attacker can allow him to distinguish two processes even though they are bisimilar. This phenomenon is related to the issue that bisimilarity is not preserved by refinement. As a sol...

متن کامل

Axiomatising ST-Bisimulation Equivalence

A simple ST operational semantics for a process algebra is provided, by defining a set of operational rules in Plotkin’s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting hierarchical specification of systems. We prove that ST-bisimulation equivalence is a c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014